A Fine Tuned Hybrid Implementation for Solving Shortest Path Problems using Bellman Ford
نویسندگان
چکیده
In this paper a hybrid implementation for Bellman-Ford to solve shortest path problems is proposed using OpenCL. Here first parallel implementation for Bellman-Ford for single source shortest path (SSSP) problem and all pair shortest path (APSP) are analyzed on CPU and GPU and based on this analysis work is divided among CPU and GPU and hybrid implementation is done. As proper resource utilization is done here we have termed it a fine tuned implementation. We have got considerable speedup of 2.88x over parallel implementation on GPU for SSSP and 3.3x over parallel implementation of Bellman-Ford for APSP on GPU.
منابع مشابه
Verilog Implementation of a System for Finding Shortest Path by Using Bellman Ford Algorithm
There exit several high speed computation applications that requires minimum distance computation between nodes in weighted graph. Dedicated techniques exist for this purpose are called as shortest path computation. Depending upon need of application, there are three type of shortest path problems; Single Source Shortest Path (SSSP), Single Destination Shortest Path (SDSP) and All Pair Shortest...
متن کاملShortest-path calculation of first arrival traveltimes by expanding wavefronts
A new approach to computing traveltimes and ray paths by solving the shortest path problem is presented. The technique is based on a partitioning of the shortest path optimization problem into smaller problems. We recursively evaluate the solution on expanding wavefronts instead of finding the global shortest paths from the source. To solve the local minimization, we apply a modified version of...
متن کاملFinding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملA Review And Evaluations Of Shortest Path Algorithms
Nowadays, in computer networks, the routing is based on the shortest path problem. This will help in minimizing the overall costs of setting up computer networks. New technologies such as map-related systems are also applying the shortest path problem. This paper’s main objective is to evaluate the Dijkstra’s Algorithm, Floyd-Warshall Algorithm, Bellman-Ford Algorithm, and Genetic Algorithm (GA...
متن کاملOn the optimality of Bellman-Ford-Moore shortest path algorithm
We prove a general lower bound on the size of switching-and-rectifier networks over any semiring of zero characteristic, including the (min,+) semiring. Using it, we show that the classical dynamic programming algorithm of Bellman, Ford and Moore for the shortest s-t path problem is optimal, if only Min and Sum operations are allowed.
متن کامل